Algebra of Program Termination
نویسندگان
چکیده
Well-foundedness and indu tive properties of relations are expressed in terms of xed points. A lass of xed point equations, alled \hylo" equations, is introdu ed. A methodology of re ursive program design based on the use of hylo equations is presented. Current resear h on generalisations of well-foundedness and indu tive properties of relations, making these properties relative to a datatype, is introdu ed. ∗ EverMind, Westerkade 15/4, 9718 AS Groningen, The Netherlands † S hool of Computer S ien e and Information Te hnology, University of Nottingham, Nottingham NG8 1BB, England
منابع مشابه
Unrestricted Termination and Non-termination Arguments for Bit-Vector Programs
Proving program termination is typically done by finding a well-founded ranking function for the program states. Existing termination provers typically find ranking functions using either linear algebra or templates. As such they are often restricted to finding linear ranking functions over mathematical integers. This class of functions is insufficient for proving termination of many terminatin...
متن کاملSynthesis of models for order-sorted first-order theories using linear algebra and constraint solving
Recent developments in termination analysis for declarative programs emphasize the use of appropriate models for the logical theory representing the program at stake as a generic approach to prove termination of declarative programs. In this setting, Order-Sorted First-Order Logic provides a powerful framework to represent declarative programs. It also provides a target logic to obtain models f...
متن کاملCARIBOO : A Multi-Strategy Termination Proof Tool Based on Induction
CARIBOO is a termination proof tool for rule-based programming languages, where a program is a rewrite system and query evaluation consists in rewriting a ground expression [3]. It applies to languages such as ASF+SDF, Maude, Cafe-OBJ, or ELAN. By contrast with most of the existing tools, which prove in general termination of standard rewriting (rewriting without strategy) on the free term alge...
متن کاملOn Two Dually Nondeterministic Refinement Algebras
A dually nondeterministic refinement algebra with a negation operator is proposed. The algebra facilitates reasoning about totalcorrectness preserving program transformations and nondeterministic programs. The negation operator is used to express enabledness and termination operators through a useful explicit definition. As a small application, a property of action systems is proved employing t...
متن کاملTermination Analysis of Polynomial Programs with Equality Conditions
In this paper, we investigate the termination problem of a family of polynomial programs, in which all assignments to program variables are polynomials, and test conditions of loops and conditional statements are polynomial equations. Our main result is that the non-terminating inputs of such a polynomial program is algorithmically computable according to a strictly descending chain of algebrai...
متن کاملModal Kleene Algebra Applied to Program Correctness
Modal Kleene algebras are relatives of dynamic logics that support program construction and verification by equational reasoning. We describe their application in implementing versatile program correctness components in interactive theorem provers such as Isabelle/HOL. Starting from a weakest precondition based component with a simple relational store model, we show how variants for Hoare logic...
متن کامل